On the Languages Accepted by Watson-Crick Finite Automata with Delays

In this work, we analyze the computational power of Watson-Crick finite automata (WKFA) if some restrictions over transition function in model are imposed. We consider that imposed refer to maximum length difference between two input strands which is called delay. prove language class accepted by WKFA with such a proper subclass languages arbitrary general. addition, initiate study classes characterized WKFAs bounded delays. results means various relationships and sticker systems.